Weighted 3-Wise 2-Intersecting Families
نویسندگان
چکیده
Let n and r be positive integers. Suppose that a family F ⊂ 2[n] satisfies |F1 ∩ F2 ∩ F3| ≥ 2 for all F1, F2, F3 ∈ F . We prove that if w < 0.5018 then ∑ F∈F w |F |(1− w)n−|F | ≤ w2.
منابع مشابه
Intersecting Families — Uniform versus Weighted
What is the maximal size of k-uniform r-wise t-intersecting families? We show that this problem is essentially equivalent to determine the maximal weight of non-uniform r-wise t-intersecting families. Some EKR type examples and their applications are included.
متن کاملWeighted Non-Trivial Multiply Intersecting Families
Let n,r and t be positive integers. A family F of subsets of [n]={1,2, . . . ,n} is called r-wise t-intersecting if |F1∩·· ·∩Fr|≥ t holds for all F1, . . . ,Fr ∈F . An r-wise 1-intersecting family is also called an r-wise intersecting family for short. An r-wise t-intersecting family F is called non-trivial if |⋂F∈F F |<t. Let us define the Brace–Daykin structure as follows. F BD = {F ⊂ [n] : |...
متن کاملOn Symmetric 3-wise Intersecting Families
A family of sets is said to be symmetric if its automorphism group is transitive, and 3-wise intersecting if any three sets in the family have nonempty intersection. Frankl conjectured in 1981 that if A is a symmetric 3-wise intersecting family of subsets of {1, 2, . . . , n}, then |A| = o(2). Here, we give a short proof of Frankl’s conjecture using a sharp threshold result of Friedgut and Kalai.
متن کامل3-Wise Exactly 1-Intersecting Families of Sets
Let f(l,t,n) be the maximal size of a family F ⊂ 2[n] such that any l ≥ 2 sets of F have an exactly t ≥ 1-element intersection. If l ≥ 3, it trivially comes from [8] that the optimal families are trivially intersecting (there is a t-element core contained by all the members of the family). Hence it is easy to determine f(l, t, n) = ⌊ l 2(n− 1) ⌋ +1. Let g(l, t, n) be the maximal size of an l-wi...
متن کاملMultiply-intersecting families
Intersection problems occupy an important place in the theory of finite sets. One of the central notions is that of a r-wise r-intersecting family, that is, a collection holds for all choices of 1 < il < < i, < m. What is the maximal size m = m(n, r, t) of a r-wise t-intersecting family? Taking all subsets containing a fixed t-element set shows that m(n, r, 1) > 2 "-' holds for all n 3 f 2 0. O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 100 شماره
صفحات -
تاریخ انتشار 2002